Performance analysis of a discrete-time Geo / G /1 queue with randomized vacations and at most J vacations
نویسندگان
چکیده
منابع مشابه
Performance Analysis of a Discrete-time Geo/g/1 Queue with Multiple Adaptive Vacations and Variable Input Rate
This paper considers a discrete-time Geo/G/1 queue with multiple adaptive vacations and variable input rate. The main purpose of this paper is to present a queuelength analysis of this system. Using a new analytic method, the late arrival system with delayed access (LAS-DA) and the early arrival system (EAS), have been examined. For both the cases, We derive the recursive solution for queue len...
متن کاملThe Discrete-Time Bulk-Service Geo/Geo/1 Queue with Multiple Working Vacations
This paper deals with a discrete-time bulk-service Geo/Geo/1 queueing system with infinite buffer space and multiple working vacations. Considering an early arrival system, as soon as the server empties the system in a regular busy period, he leaves the system and takes a working vacation for a random duration at time n. The service times both in a working vacation and in a busy period and the ...
متن کاملThe discrete-time GI/Geo/1 queue with working vacations and vacation interruption
In this paper, we consider a GI/Geo/1 queue with working vacations and vacation interruption. The server takes the original work at the lower rate rather than completely stopping during the vacation period. Meanwhile, we introduce vacation interruption policy: the server can come back to the normal working level once there are customers after a service completion during the vacation period, thu...
متن کاملAnalysis of a M/G/1/K Queue without Vacations
We consider the single server, finite capacity queue with Poisson arrivals and generally distributed service times. The M/G/1/K system may be analysed using an imbedded Markov Chain approach very similar to the one followed in Section 3.2. A queue of this type may be a better representation of a real-life system. This is because the infinite number of buffers implied by the M/G/1 (really the M/...
متن کاملAnalyzing discrete-time D-BMAP/G/1/N queue with single and multiple vacations
This paper analyzes a single-server finite-buffer vacation (single and multiple) queue wherein the input process follows a discrete-time batch Markovian arrival process (D-BMAP). The service and vacation times are generally distributed and their durations are integral multiples of a slot duration. We obtain the state probabilities at service completion, vacation termination, arbitrary, and prea...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Mathematical Modelling
سال: 2013
ISSN: 0307-904X
DOI: 10.1016/j.apm.2013.01.033